THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES
نویسندگان
چکیده
منابع مشابه
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations like average have been considered. Here, we investigate quantitative context-free languages over very general weight structures incorporating all semirings, a...
متن کاملA Chomsky-Schützenberger Representation for Weighted Multiple Context-free Languages
We prove a Chomsky-Schützenberger representation theorem for weighted multiple context-free languages.
متن کاملChomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
It is a well-known theorem by Chomsky and Schützenberger (1963) that every context-free language can be represented as a homomorphic image of the intersection of a Dyck language and a regular language. This paper gives a Chomsky-Schützenberger-type characterization for multiple context-free languages, which are a natural extension of context-free languages, with introducing the notion of multip...
متن کاملMultidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars
Weir [43] proved a Chomsky-Schützenberger-like representation theorem for the string languages of tree-adjoining grammars, where the Dyck language Dn in the Chomsky-Schützenberger characterization is replaced by the intersection D2n ∩ g(D2n), where g is a certain bijection on the alphabet consisting of 2n pairs of brackets. This paper presents a generalization of this theorem to the string lang...
متن کاملParsing CFGs and PCFGs with a Chomsky-Schützenberger Representation
We present a parsing algorithm for arbitrary context-free and probabilistic context-free grammars based on a representation of such grammars as a combination of a regular grammar and a grammar of balanced parentheses, similar to the representation used in the Chomsky-Schützenberger theorem. The basic algorithm has the same worst-case complexity as the popular CKY and Earley parsing algorithms f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2014
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054114400176